Psychological constructs as local optima
نویسندگان
چکیده
Psychological constructs are necessary abstractions to operationalize otherwise intractable entities. However, the way defined and refined over time introduces notable bias into models of behaviour, which prevents effective knowledge building within across subfields.
منابع مشابه
Escaping local optima in POMDP planning as inference
Planning as inference recently emerged as a versatile approach to decision-theoretic planning and reinforcement learning for single and multi-agent systems in fully and partially observable domains with discrete and continuous variables. Since planning as inference essentially tackles a non-convex optimization problem when the states are partially observable, there is a need to develop techniqu...
متن کاملExploring Local Optima in Schematic Layout
Abstract—In search-based graph drawing methods there are typically a number of parameters that control the search algorithm. These parameters do not affect the fitness function, but nevertheless have an impact on the final layout. One such search method is hill climbing, and, in the context of schematic layout, we explore how varying three parameters (grid spacing, the starting distance of allo...
متن کاملEfficiency of Local Search with Multiple Local Optima
The first contribution of this paper is a theoretical investigation of combinatorial optimization problems. Their landscapes are specified by the set of neighborhoods of all points of the search space. The aim of the paper consists of the estimation of the number N of local optima and the distributions of the sizes (αj) of their attraction basins. For different types of landscapes we give preci...
متن کاملOn Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima when run repeatedly. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES...
متن کاملLocal Optima Networks with Escape Edges
Abstract. This paper proposes an alternative definition of edges (escape edges) for the recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON). The model compresses the information given by the whole search space into a smaller mathematical object that is the graph having as vertices the local optima and as edges the possible weighted transitions betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Psychology
سال: 2022
ISSN: ['2731-0574']
DOI: https://doi.org/10.1038/s44159-022-00042-2